Reusable Multi-Stage Multi-Secret Sharing Schemes Based on CRT
نویسندگان
چکیده
منابع مشابه
CRT Based Threshold Multi Secret Sharing Scheme
This paper presents a novel secret sharing system that is based on Chinese remainder theorem. This scheme deals with a concept of multiple secrets to be shared to different groups, such that each group receives shares of secret intended for it. The sharing is a threshold scheme, that is more than a fixed number of members from any particular group, will be able to reconstruct the secret and any...
متن کاملMulti-linear Secret-Sharing Schemes
Multi-linear secret-sharing schemes are the most common secret-sharing schemes. In these schemes the secret is composed of some field elements and the sharing is done by applying some fixed linear mapping on the field elements of the secret and some randomly chosen field elements. If the secret contains one field element, then the scheme is called linear. The importance of multi-linear schemes ...
متن کاملRandomness in Multi-Secret Sharing Schemes
A multi{secret sharing scheme is a protocol to share a number of (arbitrarily related) secrets among a set of participants in such a way that only quali ed sets of participants can recover the secrets, whereas non-quali ed sets of participants might have partial information about them. In this paper we analyze the amount of randomness needed by multi{secret sharing schemes. Given an m-tuple of ...
متن کاملLattice-based threshold-changeability for standard CRT secret-sharing schemes
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have secure channels between shareholders. In contrast, we s...
متن کاملParallel Multi-party Computation from Linear Multi-secret Sharing Schemes
As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against an adversary with multistructures. Precisely, there are m functions f1, ..., fm and m adversary structures A1, ...,Am, where fi is required to be securely computed against an Ai-adversary. We give a general construction to build...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Communications Software and Systems
سال: 2015
ISSN: 1846-6079,1845-6421
DOI: 10.24138/jcomss.v11i1.113